Answering reachability queries on streaming graphs

Graph reachability is a fundamental problem in many applications, such as reasoning in lightweight formalisms, geographic navigation, XML/RDF/OWL query processing, etc. Many real world scenarios involve huge graphs and require fast algorithms to test for reachability between nodes. The problem becomes even more challenging when the graph is rapidly changing and received as a real-time stream of nodes and arcs. In this paper we will review current graph reachability algorithms and focus on how they can be adapted to the streaming setting. We will also outline a new algorithm for answering reachability queries on huge, rapidly changing graphs.